n,m=map(int,input().split())
inc=[0]*m
edges=[]
for i in range(m):
a,b=map(int,input().split())
inc[i]=b
edges.append((a,b,i))
edges.sort(key=lambda x:(x[0],-x[1]))
ans=[[] for _ in range(m)]
last=1
fro=2
to=3
f=True
for a,b,ind in edges:
if inc[ind]:
last+=1
ans[ind]=[1,last]
else:
if to==fro:
to+=1
fro=2
if to>last:
f=False
break
ans[ind]=[fro,to]
fro+=1
if f:
for el in ans:
print(*el)
else:
print(-1)
240. Search a 2D Matrix II | 238. Product of Array Except Self |
229. Majority Element II | 222. Count Complete Tree Nodes |
215. Kth Largest Element in an Array | 198. House Robber |
153. Find Minimum in Rotated Sorted Array | 150. Evaluate Reverse Polish Notation |
144. Binary Tree Preorder Traversal | 137. Single Number II |
130. Surrounded Regions | 129. Sum Root to Leaf Numbers |
120. Triangle | 102. Binary Tree Level Order Traversal |
96. Unique Binary Search Trees | 75. Sort Colors |
74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |